Verification in Higher Order Logic of Mutual Exclusion Algorithm
نویسنده
چکیده
In this work a mutual exclusion algorithm is mod-eled using Transition Assertions. The main feature of a mutual exclusion algorithm is to prevent simultaneous access of a shared resource by two or more systems. The speciication of the algorithm is a collection of transition assertions with each transition assertion containing a precondition and postcondition. The Transition Assertions model is formalized in higher order logic and the HOL mechanized theorem prover is used to show that the Transition Assertions model complies with the mutual exclusion requirement.
منابع مشابه
An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملCarnegie Mellon University Unbounded System Verification Using Decision Procedure and Predicate Abstraction
Modeling and analysis of systems with large, infinite or parameterized state spaces has received much attention in the last decade. These systems include microprocessors with unbounded buffers and memories; parameterized cache-coherence and communication protocols with unbounded channels; and distributed algorithms for mutual exclusion. Most previous works have either used general purpose theor...
متن کاملVerification of a Hierarchical Generic Mutual Exclusion Algorithm
In distributed environments, the shared resources access control by mutual exclusion paradigm is a recurrent key problem. To cope with the new constraints implied by recently developed large scale distributed systems like grids, mutual exclusion algorithms become more and more complex and thus much harder to prove and/or verify. In this article, we propose the formal modeling and the verificati...
متن کاملVerification of mutual exclusion algorithms with EST
Mutual exclusion algorithms are a simple and popular example of concurrent systems. We report about the verification of some of them with verification package EST. In the paper we propose modified models for Dekker’s and Peterson’s algorithm which give a compound system without divergent states. For Hyman’s algorithm, we explain why it does not preserve mutual exclusion.
متن کاملMissing 4 Pages of Text Appeared in Ieee Symposium on Logic Programming 1987 Logic, Equations, and Functions
y We introduce a new paradigm for the integration of functional and logic programming. Unlike most current research, our approach is not based on extending uniication to general-purpose equation solving. Rather, we propose a computation delaying mechanism called residuation. This allows a clear distinction between functional evaluation and logical deduction. The former is based on the-calculus,...
متن کامل